package HuaweiOD;

import java.util.Arrays;
import java.util.Scanner;

public class 爱吃蟠桃的孙悟空 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int[] peaches = Arrays.stream(in.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
        int h = Integer.parseInt(in.nextLine());
        System.out.println(solve(peaches, h));
    }
    
    public static int solve(int[] peaches, int h){
        
        if (peaches.length > h){
            return 0;
        }

        int max = Arrays.stream(peaches).max().orElse(0);
        if (peaches.length == h){
            return max;
        }
        
        int min = 1;
        int ans = max;

        while (min <= max){
            int mid = min + ((max - min) >> 1);
            if (check(peaches, mid, h)){
                ans = mid;
                max = mid - 1;
            }else {
                min = mid + 1;
            }
        }
        return ans;
    }
    
    public static boolean check(int[] peaches, int speed, int h){

        int sum = 0;
        for (int peach : peaches) {
            sum += peach / speed + (peach % speed > 0 ? 1 : 0);
            if (sum > h){
                return false;
            }
        }
        
        return true;
    }
}
